-
1 quadratic programming problem
Математика: задача квадратического программированияУниверсальный англо-русский словарь > quadratic programming problem
-
2 quadratic programming problem
English-Russian scientific dictionary > quadratic programming problem
-
3 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem -
4 problem
задача; проблема- accounting problem
- allocation problem
- assignment problem
- ballot problem
- benchmark problem
- blending problem
- bottleneck problem
- boundary-value problem
- boundary problem
- business problem
- Byzantine Generals problem
- center problem
- check problem
- chess problem
- commonly encountered problem
- computational problem
- continuum problem
- covering problem
- data problem
- data-set problem
- daunting problem
- decision problem
- deducibility problem
- design problem
- dining philosophers' problem
- dual problem
- eigenvalue assignment problem
- eigenvalue problem
- estimation problem
- EVA problem
- extremely ill-conditioned problem
- fault-location problem
- filtering problem
- findpath problem
- finger-pointing problem
- flow problem
- frame problem
- free-boundary problem
- game-theory problem
- game problem
- graph theoretic problem
- graphics problem
- ill-conditioned problem
- ill-defined problem
- ill-posed problem
- inference problem
- information retrieval problem
- initial value problem
- intractable problem
- job-shop problem
- knapsack problem
- Konigsberg bridge problem
- labyrinth problem
- location problem
- logical problem
- management problem
- market analysis problem
- marriage problem
- maximum flow problem
- maximum network flow problem
- mildly ill-posed problem
- minimal connector problem
- model problem
- multivariate problem
- newspaper-boy problem
- ninety percent complete problem
- nominal design problem
- off-by-one problem
- omelet problem
- one-sample problem
- postman problem
- programming problem
- projection problem
- pursuit problem
- quadratic assignment problem
- queuing problem
- race problem
- ramification problem
- real-time problem
- real-world problem
- reducibility problem
- resource allocation problem
- routing problem
- ruin problem
- satisfiability problem
- scheduling problem
- search problem
- severely ill-posed problem
- shortest route problem
- simulated problem
- software problem
- sparse problem
- stale data problem
- stochastic problem
- switchbox routing problem
- switchbox problem
- target assignment problem
- test problem
- three-dimensional problem
- time transportation problem
- trade-off problem
- traffic problem
- transport problem
- transportation problem
- traveling salesman problem
- trouble-location problem
- troubleshooting problem
- unconstrained problem
- undecidable problem
- underdetermined problem
- unsolvable problem
- unstructured problem
- variational problem
- vessel loading problem
- waiting line problem
- weak bridge problem
- well-behaved problem
- well-defined problem
- well-posed problemEnglish-Russian dictionary of computer science and programming > problem
-
5 problem
1) задача; проблема2) осложнение; затруднение•problem with fixed end-points — (вариационная) задача с закреплёнными концами;-
benchmark problem
-
boundary-value problem
-
boundary problem
-
characteristic problem
-
chess problem
-
computational problem
-
construction problem
-
convex programming problem
-
Diophantine problem
-
direction-finding problem
-
drilling problems
-
dynamical problem
-
eigenvalue problem
-
exterior problem
-
extremal problem
-
game problem
-
heat problem of friction
-
homogeneous problem
-
ill-conditioned problem
-
ill-defined problem
-
ill-posed problem
-
initial-value problem
-
inverse problem
-
isoperimetrical problem
-
isoperimetric problem
-
logical problem
-
logic problem
-
many-dimensional problem
-
maximum problem
-
minimization problem
-
minimum problem
-
mixed problem
-
model problem
-
multiobjective problem
-
operating problems
-
optimization problem
-
problem of control
-
problem of moments
-
problem of pursuit
-
queuing problem
-
reliability problem
-
starch problem
-
test problem
-
toy problem
-
trade-off problem
-
transportation problem
-
transport problem
-
troubleshooting problem
-
undecidable problem
-
variational problem
-
work problem
См. также в других словарях:
Quadratic programming — (QP) is a special type of mathematical optimization problem. It is the problem of optimizing (minimizing or maximizing) a quadratic function of several variables subject to linear constraints on these variables.The quadratic programming problem… … Wikipedia
Sequential quadratic programming — (SQP) is one of the most popular and robust algorithms for nonlinear continuous optimization. The method is based on solving a series of subproblems designed to minimize a quadratic model of the objective subject to a linearization of the… … Wikipedia
Quadratic — In mathematics, the term quadratic describes something that pertains to squares, to the operation of squaring, to terms of the second degree, or equations or formulas that involve such terms. Quadratus is Latin for square . Mathematics Algebra… … Wikipedia
Quadratic probing — is a scheme in computer programming for resolving collisions in hash tables.Quadratic probing operates by taking the original hash value and adding successive values of an arbitrary quadratic polynomial to the starting value. This algorithm is… … Wikipedia
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… … Wikipedia
Semidefinite programming — (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function over the intersection of the cone of positive semidefinite matrices with an affine space.Semidefinite programming is a relatively new field… … Wikipedia
Nonlinear programming — In mathematics, nonlinear programming (NLP) is the process of solving a system of equalities and inequalities, collectively termed constraints, over a set of unknown real variables, along with an objective function to be maximized or minimized,… … Wikipedia
Knapsack problem — BKP redirects here. For other uses, see BKP (disambiguation). Example of a one dimensional (constraint) knapsack problem: which boxes should be chosen to maximize the amount of money while still keeping the overall weight under or equal to… … Wikipedia
Linear complementarity problem — In mathematical optimization theory, the linear complementarity problem, or LCP, is a special case of quadratic programming which arises frequently in computational mechanics. Given a real matrix M and vector b, the linear complementarity problem … Wikipedia
Mixed complementarity problem — (MCP) is a problem formulation in mathematical programming. Many well known problem types are special cases of, or may be reduced to MCP. It is a generalization of Nonlinear complementarity problem (NCP). Definition The mixed complementarity… … Wikipedia